The Kervaire–laudenbach Conjecture and Presentations of Simple Groups*
نویسنده
چکیده
The statement “no nonabelian simple group can be obtained from a nonsimple group by adding one generator and one relator” 1) is equivalent to the Kervaire–Laudenbach conjecture; 2) becomes true under the additional assumption that the initial nonsimple group is either finite or torsion-free.
منابع مشابه
On Quasivarities of Groups and Equations over Groups
We prove that the quasivariety of groups generated by finite and locally indicable groups does not contain the class of periodic groups. This result is related to (and inspired by) the solvability of equations over groups. The proof uses the Feit-Thompson theorem on the solvability of finite groups of odd order, Kostrikin-Zelmanov results on the restricted Burnside problem and applies techninal...
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملConstructing Piecewise Linear 2-knot Complements
The groups of high dimensional knots have been characterized by Kervaire [7], but there is still no general description of all 2-knot groups. Kervaire identified a large class of groups that are natural candidates to serve as 2-knot groups and proved that each of these groups is the group of the complement of a smooth 2-sphere in a homotopy 4-sphere. Freedman’s solution to the 4-dimensional Poi...
متن کاملNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کامل2-recognizability of the simple groups $B_n(3)$ and $C_n(3)$ by prime graph
Let $G$ be a finite group and let $GK(G)$ be the prime graph of $G$. We assume that $ngeqslant 5 $ is an odd number. In this paper, we show that the simple groups $B_n(3)$ and $C_n(3)$ are 2-recognizable by their prime graphs. As consequences of the result, the characterizability of the groups $B_n(3)$ and $C_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004